Growth of preferential attachment random graphs via continuous-time branching processes

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time branching scheme and, using the branching process apparatus, several results on the graph model asymptotics are obtained, some extending previous results, such as growth rates for a typical degree and the maximal degree, behavior of the vertex where the maximal degree is attained, and a law of large numbers for the empirical distribution of degrees which shows certain ``scale-free'' or ``power-law'' behaviors.Comment: 20 page

THE ALGEBRA GENERATED BY THREE COMMUTING MATRICES

Abstract. We present a survey of an open problem concerning the dimension of the algebra generated by three commuting matrices. This article concerns a problem in algebra that is completely elementary to state, yet, has proven tantalizingly difficult and is as yet unsolved. Consider C[A, B, C] , the C-subalgebra of the n × n matrices Mn(C) generated by three commuting matrices A, B, and C. Thus, C[A, B, C] consists of all C-linear combinations of “monomials ” A i B j C k, where i, j, and k range from 0 to infinity. Note that C[A, B, C] and Mn(C) are naturally vector-spaces over C; moreover, C[A, B, C] is a subspace of Mn(C). The problem, quite simply, is this: Is the dimension of C[A, B, C] as a C vector space bounded above by n? Note that the dimension of C[A, B, C] is at most n 2, because the dimension of Mn(C) is n 2. Asking for the dimension of C[A, B, C] to be bounded above by n when A, B, and C commute is to put considerable restrictions on C[A, B, C]: this is to require that C[A, B, C] occupy only a small portion of the ambient Mn(C) space in which it sits. Actually, the dimension of C[A, B, C] is already bounded above by something slightly smaller than n 2, thanks to a classical theorem of Schur ([16]), who showed that the maximum possible dimension of a commutative C-subalgebra of Mn(C) is 1 + ⌊n2 /4⌋. But n is small relative even to this number. To understand the interest in n being an upper bound for the dimension of C[A, B, C], let us look more generally at the dimension of the C-subalgebra of Mn(C) generated by k-commuting matrices. Let us start with the k = 1 case: note that “one commuting matrix ” is just an arbitrary matrix A. Recall that the Cayley-Hamilton theorem tells us that A n is a linear combination of I, A,..., A n−1, where I stands for the identity matrix. From this, it follows by repeated reduction that A n+1, A n+2, etc. are all linear combinations of I, A,..., A n−1 Thus, C[A], the C-subalgebra of Mn(C) generated by A, is of dimension at most n, and this is just a simple consequence of Cayley-Hamilton. The case k = 2 is therefore the first significant case. It was treated by Gerstenhaber ([4]) as well as Motzkin and Taussky-Todd ([13], who proved independently that the variety of commuting pairs of matrices is irreducible. It follows from this that if A and B are two commuting matrices, then too